Pseudorandom sequences from elliptic curves

نویسندگان

  • P. H. T. Beelen
  • J. M. Doumen
چکیده

In this article we will generalize some known constructions to produce pseudorandom sequences with the aid of elliptic curves. We will make use of both additive and multiplicative characters on elliptic curves.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

'Good' Pseudo-Random Binary Sequences from Elliptic Curves

Some families of binary sequences are constructed from elliptic curves. Such sequences are shown to be of strong pseudorandom properties with ‘small’ well-distribution measure and ‘small’ correlation measure of ‘small’ order, both of which were introduced by Mauduit and Sárközy to analyze the pseudo-randomness of binary sequences.

متن کامل

Elliptic Curve Pseudorandom Sequence Generators

In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF (2). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We determine their periods, distribution of zeros and ones, and linear spans for a class of EC-sequences generated from supersingular curves. We exhibit a class of EC-sequences wh...

متن کامل

Elliptic curve analogues of a pseudorandom generator

Using the discrete logarithm in [7] and [9] a large family of pseudorandom binary sequences was constructed. Here we extend this construction. An interesting feature of this extension is that in certain special cases we get sequences involving points on elliptic curves. 2000 AMS Mathematics Subject Classification: 11K45. List of keywords and phrases: pseudorandom, elliptic curve.

متن کامل

On Pseudo-Random Number Generators Using Elliptic Curves and Chaotic Systems

Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography which is based on the arithmetic on elliptic curves and security of the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. Elliptic curve algorithms are also applie...

متن کامل

On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve

In this paper we study the pseudorandom properties of sequences of points on elliptic curves. These sequences are constructed by taking linear combinations with small coefficients (e.g. −1, 0,+1) of the orbit elements of a point with respect to a given endomorphism of the curve. We investigate the linear complexity and the distribution of these sequences. The result on the linear complexity ans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002